import java.util.Scanner;

/**
 * @author: gao
 * @create-date: 2025/4/12 14:15
 */

public class Solution {
    public double myPow(double x, int n) {
        return n < 0 ? 1 / pow(x, -n) : pow(x, n);
    }

    public double pow(double x, int n) {
        if (n == 0) return 1.0;
        double tmp = pow(x, n / 2);
        return n % 2 == 0 ? tmp * tmp : tmp * tmp * x;
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        while (in.hasNext()) {
            double x = in.nextDouble();
            int n = in.nextInt();
            Solution solution = new Solution();
            System.out.println(solution.myPow(x, n));
            Solution solution1 = new Solution();
        }
    }
}